A sixth-order imbedded Runge-Kutta algorithm with continuously variable weights
نویسندگان
چکیده
منابع مشابه
DKLAG6: a code based on continuously imbedded sixth-order Runge-Kutta methods for the solution of state-dependent functional differential equations
This paper discusses a new family of sixth-order continuously imbedded Runge-Kutta-Sarafyan methods and a mathematical software package DKLAG6 for the numerical solution of systems of functional differential equations with state-dependent delays. The methods used are based on piecewise polynomial approximants which are used for error estimation and stepsize selection, to handle the necessary in...
متن کاملDKLAG6: A Code Based on Continuously Imbedded Sixth Order Runge{Kutta Methods for the Solution of State Dependent Functional Di erential Equations
This paper discusses a new family of sixth{order continuously imbedded Runge{Kutta{ Sarafyan methods and a mathematical software package DKLAG6 for the numerical solution of systems of functional di erential equations with state dependent delays. The methods used are based on piecewise polynomial approximants which are used for error estimation and stepsize selection, to handle the necessary in...
متن کاملNonstandard explicit third-order Runge-Kutta method with positivity property
When one solves differential equations, modeling physical phenomena, it is of great importance to take physical constraints into account. More precisely, numerical schemes have to be designed such that discrete solutions satisfy the same constraints as exact solutions. Based on general theory for positivity, with an explicit third-order Runge-Kutta method (we will refer to it as RK3 method) pos...
متن کاملLow-dissipation and low-dispersion fourth-order Runge–Kutta algorithm
An optimized explicit low-storage fourth-order Runge–Kutta algorithm is proposed in the present work for time integration. Dispersion and dissipation of the scheme are minimized in the Fourier space over a large range of frequencies for linear operators while enforcing a wide stability range. The scheme remains of order four with nonlinear operators thanks to the low-storage algorithm. Linear a...
متن کاملRandom Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for long periods in deep local minima. Clause weighting algorithms such as DLM, GLS, ESG and SAPS are good at escaping local minima but require expensive smoothing phases in which all weights are updated. We show that Wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1986
ISSN: 0898-1221
DOI: 10.1016/0898-1221(86)90066-0